class Solution {
public:
    int minOperations(vector<int>& nums, int k) {
        sort(nums.begin(),nums.end());
        int left=0,right=nums.size()-1;
        while(left<right)
        {
            int mid=left+(right-left)/2;
            if(nums[mid]<k)
            {
                left=mid+1;
            }
            else{
                right=mid;
            }
        }
        return left;
    }
};
